On Structured Belief Bases -

On Structured Belief Bases - Preliminary

In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].

Renata Wassermann on Structured Belief Bases

Most existing approaches to belief revision describe the behaviour of a highly idealized rational agent. In operations of belief change for more realistic agents, usually only a small part of an agent's beliefs is accessed at one time. This should be taken into account if we are looking for cognitively more appropriate operations. Furthermore, it makes implementation more feasible. In this pape...

On consistent belief functions

In this paper we define the class of consistent belief functions as the counterparts of consistent knowledge bases in classical logic. We prove that such class can be defined univocally no matter our definition of proposition implied by a belief function. As consistency can be desirable in decision making, the problem of transforming an arbitrary belief function into a consistent one arise, and...

Structured Belief Bases

Generalized Belief Propagation on Tree Robust Structured Region Graphs

This paper provides some new guidance in the construction of region graphs for Generalized Belief Propagation (GBP). We connect the problem of choosing the outer regions of a LoopStructured Region Graph (SRG) to that of finding a fundamental cycle basis of the corresponding Markov network. We also define a new class of tree-robust Loop-SRG for which GBP on any induced (spanning) tree of the Mar...